Enumeration of self-avoiding trails on a square lattice using a transfer matrix technique
نویسندگان
چکیده
منابع مشابه
Collapse transition of self-avoiding trails on the square lattice
The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails, which map to a particular temperature of interacting self-avoiding trails, showed markedly different behaviour for what was argued to be the collapse transi...
متن کاملSemi-flexible interacting self-avoiding trails on the square lattice
Self-avoiding walks self-interacting via nearest neighbours (ISAW) and self-avoiding trails interacting via multiply-visited sites (ISAT) are two models of the polymer collapse transition of a polymer in a dilute solution. On the square lattice it has been established numerically that the collapse transition of each model lies in a different universality class. It has been shown that by adding ...
متن کاملEnumeration of self-avoiding walks on the square lattice
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points h...
متن کاملA new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend t...
متن کاملA parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of gyration to 100. Analysis of the resulting series yields very accurate estimates of the connective constant μ= 2.638 158 530 31(3) (biased) and the critical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 1993
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/26/7/013